The implementation of AKL(FD)

نویسندگان

  • Björn Carlson
  • Mats Carlsson
  • Sverker Janson
چکیده

AKL(FD) is an integration of (an extension of) the nite domain constraint system FD in AKL, a deep concurrent constraint programming language [CJH94]. In this paper we describe the implementation of the FD solver and its adaptation to the generic constraint interface of the AGENTS implementation of AKL. We also describe compilation techniques used by the AKL(FD) compiler.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Akl(fd) { a Concurrent Language for Fd Programming Akl(fd) { a Concurrent Language for Fd Programming

We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be deened as AKL(FD) programs, which is partly mad...

متن کامل

The implementation of AKL ( FD ) Bj

AKL(FD) is an integration of (an extension of) the nite domain constraint system FD in AKL, a deep concurrent constraint programming language CJH94]. In this paper we describe the implementation of the FD solver and its adaptation to the generic constraint interface of the AGENTS implementation of AKL. We also describe compilation techniques used by the AKL(FD) compiler. 1 Introduction Conceptu...

متن کامل

AKL(FD) - A Concurrent Language for FD Programming

We consider a complete implementation of an extension of the nite domain constraint system FD, including antimonotone constraints, and its integration in AKL, a deep-guard concurrent constraint language. We present the language AKL(FD), together with associated programming techniques. In particular, we show how powerful symbolic constraints can be de ned as AKL(FD) programs, which is partly mad...

متن کامل

Planar and SPECT Monte Carlo acceleration using a variance reduction technique in I131 imaging

Background: Various variance reduction techniques such as forced detection (FD) have been implemented in Monte Carlo (MC) simulation of nuclear medicine in an effort to decrease the simulation time while keeping accuracy. However most of these techniques still result in very long MC simulation times for being implemented into routine use. Materials and Methods: Convolution-based force...

متن کامل

Optimal Incremental and Anytime Scheduling

We discuss the use of constraint programming for a class of reactive applications that concurrently monitor and control their environment. Programs dealing with such problems have to be incremental and anytime, in the sense that sensor information is accumulated incrementally and control decisions have to be made on request while the program is running. We present as a real-life example the sch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995